A segment tree based Top-k RMQ algorithm and its application to the autocomplete problem
نویسندگان
چکیده
منابع مشابه
The Unified Segment Tree and its Application to the Rectangle Intersection Problem
In this paper we introduce a variation on the multidimensional segment tree, formed by unifying different interpretations of the dimensionalities of the levels within the tree. Nodes in the resulting d-dimensional structure can have up to d parents and 2d children. In order to better visualize these relationships we introduce a diamond representation of the data structure. We show how the relat...
متن کاملconstruction and validation of translation metacognitive strategy questionnaire and its application to translation quality
like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAlgorithm for Scale Invariant Segment - Matching and Its Application to a Silhouette Matching Problem
This paper presents a method for scale invariant segment-matching of shapes. Segmentmatching is important in image analysis if perfect contours of objects are not given. One of the methods for solving this problem is the Algorithm F proposed by L. Davis. However, since the method is not scale invariant, it encounters difficulties when matching an image and a model with different scales. Bydescr...
متن کاملAlgorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
An out-tree T is an oriented tree with only one vertex of in-degree zero. A vertex x of T is internal if its out-degree is positive. We design randomized and deterministic algorithms for deciding whether an input digraph contains a given out-tree with k vertices. The algorithms are of runtime O∗(5.704k) and O∗(5.704k(1+o(1))), respectively. We apply the deterministic algorithm to obtain a deter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Business Informatics
سال: 2017
ISSN: 1998-0663
DOI: 10.17323/1998-0663.2017.1.48.54